Matching, matroids, and extensions
نویسنده
چکیده
Perhaps the two most fundamental well-solved models in combinatorial optimization are the optimal matching problem and the optimal matroid intersection problem. We review the basic results for both, and describe some more recent advances. Then we discuss extensions of these models, in particular, two recent ones—jump systems and path-matchings.
منابع مشابه
On series-parallel extensions of uniform matroids
This paper gives an excluded-minor characterization of the class of matroids that are series-parallel extensions of uniform matroids.
متن کاملGeneration of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discus...
متن کاملCones, lattices and Hilbert bases of circuits and perfect matchings
There have been a number of results and conjectures regarding the cone, the lattice and the integer cone generated by the (real-valued characteristic functions of) circuits in a binary matroid. In all three cases, one easily formulates necessary conditions for a weight vector to belong to the set in question. Families of matroids for which such necessary conditions are suucient have been determ...
متن کاملExtension Spaces of Oriented Matroids
We study the space of all extensions of a real hyperplane arrangement by a new pseudo-hyperplane, and, more generally, of an oriented matroid by a new element. The question whether this space has the homotopy type of a sphere is a special case of the “Generalized Baues Problem” of Billera, Kapranov & Sturmfels, via the Bohne-Dress Theorem on zonotopal tilings. We prove that the extension space ...
متن کاملCircular Flow and Circular Chromatic Number in the Matroid Context
This thesis considers circular flow-type and circular chromatic-type parameters (φ and χ, respectively) for matroids. In particular we focus on orientable matroids and 6 √ 1-matroids. These parameters are obtained via two approaches: algebraic and orientation-based. The general questions we discuss are: bounds for flow number; characterizations of Eulerian and bipartite matroids; and possible c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 91 شماره
صفحات -
تاریخ انتشار 2002